Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 1962 results
Sort by: relevance publication year

A Proof of the Strong Converse Theorem for Gaussian Multiple Access Channels

JOURNAL ARTICLE published August 2016 in IEEE Transactions on Information Theory

Research funded by NUS (R-263-000-A98-750/133) | Ministry of Education Tier 2, Singapore (R-263-000-B61-112) | National University of Singapore Young Investigator Award (R-263-000-B37-133)

Authors: Silas L. Fong | Vincent Y. F. Tan

https://doi.org/10.1109/tit.2016.2570243 Actions

A proof of the strong converse theorem for Gaussian multiple access channels

PROCEEDINGS ARTICLE published October 2015 in 2015 IEEE Information Theory Workshop - Fall (ITW)

Authors: Silas L. Fong | Vincent Y. F. Tan

https://doi.org/10.1109/itwf.2015.7360756 Actions

Strong converse to the quantum channel coding theorem

JOURNAL ARTICLE published 1999 in IEEE Transactions on Information Theory

Authors: T. Ogawa | H. Nagaoka

https://doi.org/10.1109/18.796386 Actions

Strong converse for identification via quantum channels

JOURNAL ARTICLE published March 2002 in IEEE Transactions on Information Theory

Authors: R. Ahlswede | A. Winter

https://doi.org/10.1109/18.985947 Actions

Addendum to "Strong converse for identification via quantum channels"

JOURNAL ARTICLE published January 2003 in IEEE Transactions on Information Theory

Authors: R. Ahlswede | A. Winter

https://doi.org/10.1109/tit.2002.806161 Actions

A Proof of the Strong Converse Theorem for Gaussian Broadcast Channels via the Gaussian Poincaré Inequality

JOURNAL ARTICLE published December 2017 in IEEE Transactions on Information Theory

Research funded by National University of Singapore Young Investigator Award (R-263-000-B37-133) | Ministry of Education Tier 2 (R-263-000-B61-112)

Authors: Silas L. Fong | Vincent Y. F. Tan

https://doi.org/10.1109/tit.2017.2753224 Actions

A simple proof of the Ahlswede - Csiszár one-bit theorem (Corresp.)

JOURNAL ARTICLE published November 1983 in IEEE Transactions on Information Theory

Authors: A.E. Gamal

https://doi.org/10.1109/tit.1983.1056742 Actions

A Wringing-Based Proof of a Second-Order Converse for the Multiple-Access Channel under Maximal Error Probability

PROCEEDINGS ARTICLE published 12 July 2021 in 2021 IEEE International Symposium on Information Theory (ISIT)

Research funded by National Science Foundation (CCF-1908725,CCF-1901243)

Authors: Fei Wei | Oliver Kosut

https://doi.org/10.1109/isit45174.2021.9518136 Actions

A Second-Order Converse Bound for the Multiple-Access Channel via Wringing Dependence

JOURNAL ARTICLE published June 2022 in IEEE Transactions on Information Theory

Research funded by National Science Foundation (CCF-1453718,CCF-1908725)

Authors: Oliver Kosut

https://doi.org/10.1109/tit.2022.3151711 Actions

Universal coding for the Slepian-Wolf data compression system and the strong converse theorem

JOURNAL ARTICLE published 1994 in IEEE Transactions on Information Theory

Authors: Y. Oohama

https://doi.org/10.1109/18.340465 Actions

Coding theorem and strong converse for quantum channels

JOURNAL ARTICLE published 1999 in IEEE Transactions on Information Theory

Authors: A. Winter

https://doi.org/10.1109/18.796385 Actions

Converse coding theorem for the identification via multiple access channels

PROCEEDINGS ARTICLE published in Proceedings of the IEEE Information Theory Workshop

Authors: Y. Oohama

https://doi.org/10.1109/itw.2002.1115441 Actions

The strong converse theorem for hypothesis testing

JOURNAL ARTICLE published 1989 in IEEE Transactions on Information Theory

Authors: T.S. Han | K. Kobayashi

https://doi.org/10.1109/18.42188 Actions

On source coding with side information via a multiple-access channel and related problems in multi-user information theory

JOURNAL ARTICLE published May 1983 in IEEE Transactions on Information Theory

Authors: R. Ahlswede

https://doi.org/10.1109/tit.1983.1056669 Actions

Converse Bounds on Modulation-Estimation Performance for the Gaussian Multiple-Access Channel

JOURNAL ARTICLE published February 2018 in IEEE Transactions on Information Theory

Authors: Ayse Unsal | Raymond Knopp | Neri Merhav

https://doi.org/10.1109/tit.2017.2779837 Actions

A per letter converse to the channel coding theorem

JOURNAL ARTICLE published October 1966 in IEEE Transactions on Information Theory

Authors: B. Reiffen

https://doi.org/10.1109/tit.1966.1053928 Actions

Optimum Transmission Through the Multiple-Antenna Gaussian Multiple Access Channel

JOURNAL ARTICLE published January 2016 in IEEE Transactions on Information Theory

Research funded by Marie Curie International Outgoing Fellowship within the European Commission, Research Executive Agency, through the COMIC Project (253990)

Authors: Daniel Calabuig | Ramy H. Gohary | Halim Yanikomeroglu

https://doi.org/10.1109/tit.2015.2502244 Actions

A proof of the strong converse theorem for Gaussian broadcast channels via the Gaussian Poincaré inequality

PROCEEDINGS ARTICLE published July 2016 in 2016 IEEE International Symposium on Information Theory (ISIT)

Authors: Silas L. Fong | Vincent Y. F. Tan

https://doi.org/10.1109/isit.2016.7541283 Actions

Elementary algebra proof exercies using a theorem proving system

PROCEEDINGS ARTICLE published January 2013 in IEEE Conference Anthology

https://doi.org/10.1109/anthology.2013.6784786 Actions

The capacity region of the totally asynchronous multiple-access channel

JOURNAL ARTICLE published March 1985 in IEEE Transactions on Information Theory

Authors: J. Hui | P. Humblet

https://doi.org/10.1109/tit.1985.1057012 Actions
Feedback: support@crossref.org